The Complexity of Bottleneck Labeled Graph Problems

We study bottleneck labeled optimization problems arising in the context of graph theory. This long-established model partitions the set of edges into classes, each of which is identified by a unique color. The generic objective is to construct a subgraph of prescribed structure (such as an s-t path, a spanning tree, or a perfect matching) while trying to minimize the maximum (or, alternatively, maximize the minimum) number of edges picked from any given color.     

Molecularly Targeted Agents as Radiosensitizers in Cancer Therapy—Focus on Prostate Cancer

As our understanding of the molecular pathways driving tumorigenesis improves and more druggable targets are identified, we have witnessed a concomitant increase in the development and production of novel molecularly targeted agents. Radiotherapy is commonly used in the treatment of various malignancies with a prominent role in the care of prostate cancer patients, and efforts to improve the therapeutic ratio of radiation by technologic and pharmacologic means have led to important advances in cancer care. One promising approach is to combine molecularly targeted systemic agents with radiotherapy to improve tumor response rates and likelihood of durable control. This review first explores the limitations of preclinical studies as well as barriers to successful implementation of clinical trials with radiosensitizers. Special considerations related to and recommendations for the design of preclinical studies and clinical trials involving molecularly targeted agents combined with radiotherapy are provided. We then apply these concepts by reviewing a representative set of targeted therapies that show promise as radiosensitizers in the treatment of prostate cancer.     

Market penetration analysis of electric vehicles in the German passenger car market towards 2030

There is currently intensive public discussion of fuel cell electric vehicles (FCEV) and other electric powertrains, such as battery electric vehicles (BEV), plug-in hybrid electric vehicles (PHEV) and hybridized combustion engine vehicles (HEV). In this context, the German government has set the target of one million electric vehicles on the road by 2020, and six million by 2030 [1]. The goal of this paper is to identify the possible market share of electric vehicles in the German new car fleet in three scenarios in the timeframe from 2010 to 2030. The VECTOR21 vehicle technology scenario model is used to model the fleet in three scenarios. In the reference scenario with business-as-usual parameters, 189,000 electric vehicles will be sold in Germany by 2020. Scenario two with purchase price incentives from 5000 EUR, high oil prices, and low prices for hydrogen and electricity will result in 727,000 vehicles. In the last scenario with substantial OEM mark-up reductions and external conditions as in the business-as-usual scenario, 3.28 million vehicles will be sold.     

Investigation of direct load management scheme with consideration of end‐user comfort

A direct load management scheme with two‐way communication, with consideration of end‐user comfort, is proposed. First, the control algorithm is developed and the data required to be transmitted between system operator and controllable loads are identified. Then, the actions of controllable air conditioners and the power adjustment of dispersed generators to eliminate overloads in a substation transformer are simulated. The results indicate that the proposed load management technique performs effectively to reduce overloads on the transformer while maintaining energy consumption in each load, and the performance is improved by coordination with the output of dispersed generators. © 2011 Wiley Periodicals, Inc. Electr Eng Jpn, 176(3): 19–28, 2011; Published online in Wiley Online Library ( wileyonlinelibrary.com ). DOI 10.1002/eej.21139     

Maintaining Privacy on a Line

Consider a situation where people have to choose among a sequence of n linearly ordered positions to perform some task requiring a certain amount of privacy. Which position should one choose so as to maximize one’s privacy, i.e., minimize the chances that one of your neighboring positions becomes occupied by a later arrival? In this paper, we attempt to answer this question under a variety of models for the behavior of the later arrivals. Our results suggest that for the most part one should probably choose one of the extreme positions (with some interesting exceptions). We also suggest a number of variations on the problem that lead to many open problems.     

Parameterized Two-Player Nash Equilibrium

We study the problem of computing Nash equilibria in a two-player normal form (bimatrix) game from the perspective of parameterized complexity. Recent results proved hardness for a number of variants, when parameterized by the support size. We complement those results, by identifying three cases in which the problem becomes fixed-parameter tractable. Our results are based on a graph-theoretic representation of a bimatrix game, and on applying graph-theoretic tools on this representation.